Winning Positions in Simplicial Nim

نویسنده

  • David G. C. Horrocks
چکیده

Simplicial Nim, introduced by Ehrenborg and Steingŕımsson, is a generalization of the classical two-player game of Nim. The heaps are placed on the vertices of a simplicial complex and a player’s move may affect any number of piles provided that the corresponding vertices form a face of the complex. In this paper, we present properties of a complex that are equivalent to the P-positions (winning positions for the second player) being closed under addition. We provide examples of such complexes and answer a number of open questions posed by Ehrenborg and Steingŕımsson.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nim-Regularity of Graphs

Ehrenborg and Steingŕımsson defined simplicial Nim, and defined Nimregular complexes to be simplicial complexes for which simplicial Nim has a particular type of winning strategy. We completely characterize the Nim-regular graphs by the exclusion of two vertex-induced subgraphs, the graph on three vertices with one edge and the graph on five vertices which is complete except for one missing edg...

متن کامل

Playing Nim on a Simplicial Complex

We introduce a generalization of the classical game of Nim by placing the piles on the vertices of a simplicial complex and allowing a move to affect the piles on any set of vertices that forms a face of the complex. Under certain conditions on the complex we present a winning strategy. These conditions are satisfied, for instance, when the simplicial complex consists of the independent sets of...

متن کامل

2-pile Nim with a Restricted Number of Move-size Imitations

We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint: Provided the previous player has just removed say x > 0 tokens from the pile with less tokens, the next player may remove x tokens from the pile with more tokens. But for each move, in “a strict sequence of previous player next player moves”, such an imitation takes place, the ...

متن کامل

Cofinite Induced Subgraphs of Impartial Combinatorial Games: An Analysis of CIS-Nim

Given an impartial combinatorial game G, we create a class of related games (CISG) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such modifications amount to taking cofinite induced subgraphs (CIS) of the original game graph. Some recent numerical/heuristic work has suggested that the underlying struc...

متن کامل

Evolving Winning Strategies for Nim-like Games

An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. The winning strategy is computed by using the Multi Expression Programming (MEP) technique a fast and efficient variant of the Genetic Programming (GP). Each play strategy is represented by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and , or, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2010